A Comparative Study on Efficient Path Finding Algorithms for Route Planning in Smart Vehicular Networks
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملTwo optimal algorithms for finding bi-directional shortest path design problem in a block layout
In this paper, Shortest Path Design Problem (SPDP) in which the path is incident to all cells is considered. The bi-directional path is one of the known types of configuration of networks for Automated Guided Vehi-cles (AGV).To solve this problem, two algorithms are developed. For each algorithm an Integer Linear Pro-gramming (ILP) is determined. The objective functions of both algorithms are t...
متن کاملEfficient Route Planning in Flight Networks
We present a set of three new time-dependent models with increasing flexibility for realistic route planning in flight networks. By these means, we obtain small graph sizes while modeling airport procedures in a realistic way. With these graphs, we are able to efficiently compute a set of best connections with multiple criteria over a full day. It even turns out that due to the very limited gra...
متن کاملSecurity of Vehicular Networks: A Comparative Study
The main goal of wireless vehicular networks is to ensure safe driving environment, but they also offer a wide variety of services and applications, most of which are safety related. Integration of effective security techniques in vehicular networks is a difficult task due to the many constraints imposed by those networks. In this Chapter, we give an overview of communication and security archi...
متن کاملEfficient Algorithms for Finding Optimal Meeting Point on Road Networks
Given a set of pointsQ on a road network, an optimal meeting point (OMP) query returns the point on a road networkG = (V,E) with the smallest sum of network distances to all the points in Q. This problem has many real world applications, such as minimizing the total travel cost for a group of people who want to find a location for gathering. While this problem has been well studied in the Eucli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Computer Networks and Applications
سال: 2020
ISSN: 2395-0455
DOI: 10.22247/ijcna/2020/204020